Global Optimization with Polynomials
نویسنده
چکیده
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0− 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-valued polynomial p(x) : R → R, as well the constraint case: minimize p(x) on a semialgebraic set K, i.e., a set defined by polynomial equalities and inequalities. We also summarize some questions that we are currently considering.
منابع مشابه
Using an Imperialistic Competitive Algorithm in Global Polynomials Optimization (Case Study: 2D Geometric Correction of IKONOS and SPOT Imagery)
The number of high resolution space imageries in photogrammetry and remote sensing society is growing fast. Although these images provide rich data, the lack of sensor calibration information and ephemeris data does not allow the users to apply precise physical models to establish the functional relationship between image space and object space. As an alternative solution, some generalized mode...
متن کاملOptimization for TCAD Purposes Using Bernstein Polynomials
The optimization of computationally expensive objective functions requires approximations that preserve the global properties of the function under investigation. The RSM approach of using multivariate polynomials of degree two can only preserve the local properties of a given function and is therefore not well-suited for global optimization tasks. In this paper we discuss generalized Bernstein...
متن کاملGlobal Optimization with Polynomials and the Problem of Moments
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : Rn → R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. A notion of Karush–Kuhn–Tucker polynomials is introduced in a glob...
متن کاملSolving polynomial least squares problems via semidefinite programming relaxations
A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomial least squares problem to polynomial semidefinite programs to reduce degrees of the polynomials are discussed. Computational efficiency of solving the original polynomial least sq...
متن کاملOn the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
In this paper, we present some new and tractable sufficient conditions for convex asymptotic well behaved (AWB) functions. Moreover, we establish several Lipschitz/Hölder type global error bound results for single convex polynomial and for function which can be expressed as maximum of finitely many nonnegative convex polynomials. An advantage of our approach is that the corresponding Hölder exp...
متن کاملSummary of Ph.D. Dissertation: Global Optimization of Polynomial Functions and Applications
where f(x) is a real multivariate polynomial in x ∈ Rn and S is a feasible set defined by polynomial equalities or inequalities. In this thesis, we do not have any convexity/concavity assumptions on f(x) or S. The goal is to find the global minimum and global minimizers if any. Polynomial optimization of form (1.1) is quite general in practical applications. Many NP-hard problems like max cut, ...
متن کامل